An output sensitive algorithm for computing a maximum independent set of a circle graph
نویسندگان
چکیده
We present an output sensitive algorithm for computing a maximum independent set of an unweighted circle graph. Our algorithm requires O(nmin{d, α}) time at worst, for an n vertex circle graph where α is the independence number of the circle graph and d is its density. Previous algorithms for this problem required Θ(nd) time at worst.
منابع مشابه
A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کاملParallel Output Sensitive
This paper gives output sensitive parallel algorithms whose performance depends on the output size and are signiicantly more eecient than previous algorithms for problems with suuciently small output size. Inputs are n n matrices over a xed ground eld. Let P (n) and M (n) be the PRAM processor bounds for O(log n) time multiplication of two degree n polynomials, and n n matrices, respectively. L...
متن کاملMaximum Independent Set for Intervals by Divide-Prune-and-Conquer
As an easy example of divide, prune, and conquer, we give an output-sensitive O(n log k)-time algorithm to compute, for n intervals, a maximum independent set of size k.
متن کاملAlgorithms for a maximum clique and a maximum independent set of a circle graph
Consider a family of chords i n a c ircle . is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. I n t h i s paper, we describe e f f i c i en t algorithms for finding a ma3cimwn clique and a maximum independent s e t of circle graphs. the number of vertices i n the graph. Key WO&: Circle graph, transi t ive graph, ...
متن کاملOn computing the general Narumi-Katayama index of some graphs
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010